#include <ctype.h>
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>

#include "uthash.h"

/**
 * Definition for a binary tree node.
 */
struct TreeNode {
	int val;
	struct TreeNode* left;
	struct TreeNode* right;
};
typedef struct TreeNode treeNode, *treeNodePtr;

int sumOfLeftLeaves(struct TreeNode* root);

int main()
{
	return 0;
}

int sumOfLeftLeaves(struct TreeNode* root)
{
	if (!root) return 0;

	int res = 0;
	if (root->left) {
		treeNodePtr le = root->left;
		if (!le->left && !le->right) res += le->val;
		else res += sumOfLeftLeaves(le);
	}
	res += sumOfLeftLeaves(root->right);

	return res;
}
